#define _CRT_SECURE_NO_WARNINGS 1

#include "Sort.h"
#include <stdio.h>
#include <time.h>
#include <stdlib.h>


void TestFileSort()
{
	MergeSortFile("data.txt");
}

void Test()
{
	srand(time(0));
	const int N = 1000'0000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	assert(a1 && a2 && a3 && a4 && a5 && a6);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand() + i;
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
	}
	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();
	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();
	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();
	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();
	int begin5 = clock();
	//QuickSort(a5, N);
	QuickSortNonRecursive(a5, N);
	int end5 = clock();
	int begin6 = clock();
	//MergeSort(a6, N);
	MergeSortNonRecursive(a6, N);
	int end6 = clock();
	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);

	//free(a4);
	//free(a5);
}


void TestSort()
{
	int arr[] = { 9,5,1,2,7,82,123,6,4,1,0,1,1,9,12,4 };
	int len = sizeof(arr) / sizeof(int);

	//InsertSort(arr, len);;
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//ShellSort(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//SelectSort(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//HeapSort(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//BubbleSort(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//QuickSort(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//QuickSortNonRecursive(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");


	//MergeSort(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//MergeSortNonRecursive(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//CountSort(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	//QuickSortThreeDivision(arr, len);
	//for (int i = 0; i < len; ++i)
	//{
	//	printf("%d ", arr[i]);
	//}
	//printf("\n");

	QuickSortNonRecursiveNonRecursive(arr, len);
	for (int i = 0; i < len; ++i)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
}



int main()
{
	//TestFileSort();
	//Test();
	TestSort();
	return 0;
}